Equational Reasoning using AC Constraints
نویسندگان
چکیده
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generates a large number of rewrite rules. By comparing it with a ground completion procedure, we show that many of the rewrite rules generated are redundant. A set of consistency constraints is formulated to detect redundant rewrite rules. We propose a new completion algorithm, consistent unfailing completion, in which only consistent rewrite rules are used for critical pair generation and rewriting. Our approach does not need to use flattened terms. Thus it avoids the double exponential worst case complexity of AC unification. It also allows the use of more flexible termination orderings. We present some sufficient conditions for detecting inconsistent rewrite rules. The proposed algorithm is implemented in PROLOG.
منابع مشابه
Associative-commutative Deduction with Constraints Associative-commutative Deduction with Constraints
Associative-commutative equational reasoning is known to be highly complex for theorem proving. Hence, it is very important to focus deduction by adding constraints, such as uniication and ordering, and to deene eecient strategies, such as the basic requirements a la Hullot. Constraints are formulas used for pruning the set of ground instances of clauses deduced by a theorem prover. We propose ...
متن کاملSufficient Completeness Checking with Propositional Tree Automata
Su cient completeness means that enough equations have been speci ed, so that the functions of an equational speci cation are fully de ned on all relevant data. This is important for both debugging and formal reasoning. In this work we extend su cient completeness methods to handle expressive speci cations involving: (i) partiality; (ii) conditional equations; and (iii) deductionmodulo axioms. ...
متن کاملTree Automata for Non-linear Arithmetic
Tree automata modulo associativity and commutativity axioms, called AC tree automata, accept trees by iterating the transition modulo equational reasoning. The class of languages accepted by monotone AC tree automata is known to include the solution set of the inequality x × y > z, which implies that the class properly includes the AC closure of regular tree languages. In the paper, we characte...
متن کاملOn Narrowing, Refutation Proofs and Constraints
We develop a proof technique for dealing with narrowing and refutational theorem proving in a uniform way, clarifying the exact relationship between the existing results in both elds and allowing us to obtain several new results. Reenements of narrowing (basic, LSE, etc.) are instances of the technique, but are also deened here for arbitrary (possibly ordering and/or equality constrained or not...
متن کاملSmaran: A Congruence-Closure Based System for Equational Computations
p. 1 Redundancy Criteria for Constrained Completion p. 2 Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations p. 17 A Case Study of Completion Modulo Distributivity and Abelian Groups p. 32 A Semantic Approach to Order-Sorted Rewriting p. 47 Distributing Equational Theorem Proving p. 62 On the Correctness of a Distributed Memory Grobner Basis Algorithm p. 77 Improving Transfor...
متن کامل